On codes with a finite deciphering delay: constructing uncompletable words
نویسندگان
چکیده
Let X be a non-complete code with a nite deciphering delay. We prove that an uncompletable word w of length O(md) exists, where d stands for the delay and m stands for the length of the longest words in X . The proof leads to an explicit construction of w. This result partially resolves a conjecture proposed by Antonio Restivo in 1979. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
In this paper we generalize an encoding method due to Girod (cf. [7]), based on binary prefix codes, that allows a bidirectional decoding of the encoded messages. In particular we generalize it to any finite alphabet A, to any operation defined on A, to any code with finite deciphering delay and to any key x ∈ A∗, whose length depends on the deciphering delay. We moreover define, as in [5], a d...
متن کاملOn Non-complete Sets and Restivo's Conjecture
A finite set S of words over the alphabet Σ is called noncomplete if Fact(S∗) 6= Σ∗. A word w ∈ Σ∗ \ Fact(S∗) is said to be uncompletable. We present a series of non-complete sets Sk whose minimal uncompletable words have length 5k − 17k+13, where k ≥ 4 is the maximal length of words in Sk. This is an infinite series of counterexamples to Restivo’s conjecture, which states that any non-complete...
متن کاملOn the Minimal Uncompletable Word Problem
Let S be a finite set of words such that Fact(S) 6= Σ. We deal with the problem of finding bounds on the minimal length of words in Σ \ Fact(S) in terms of the maximal length of words in S.
متن کاملInvariance: A Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms
Let A be a finite or countable alphabet and let θ be literal (anti)morphism onto A∗ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under θ (θ-invariant for short). We establish an extension of the famous defect theorem. Moreover, we prove that for the so-called thin θ-invariant codes, maximality and complet...
متن کاملSome Properties of Codes with Infinite Deciphering Delay
In 2013, Tommi Lehtinen and Alexander Okhotin proved that if X is a code, then it has infinite deciphering delay if and only if there exist + ∈ A z y x , , with * , , , X zy yz xy x ∈ and * , X z y ∉ . In this paper, we give a sufficient and necessary condition for codes with infinite deciphering delay. Then, we construct two kinds of three-element codes with infinite deciphering delay.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 255 شماره
صفحات -
تاریخ انتشار 2001